Case-Analysis for Rippling and Inductive Proof Moa Johansson1 , Lucas Dixon2 , and Alan Bundy2 1 Dipartimento di Informatica, Universit` a degli Studi di Verona

Source URL: dream.inf.ed.ac.uk

• Automated theorem proving
• Theoretical computer science
• Mathematical logic
• Mathematics
• Rippling
• IsaPlanner
• Mathematical proof
• Resolution
• Unification
• Mathematical induction
• Triviality

IsaPlanner: A Prototype Proof Planner in Isabelle Lucas Dixon and Jacques Fleuriot ?

Source URL: dream.inf.ed.ac.uk

• Automated theorem proving
• Theoretical computer science
• Mathematical logic
• Mathematics
• IsaPlanner
• Automated reasoning
• Isabelle
• Rippling
• Mathematical proof
• Interactive Theorem Proving
• Theorem
• Mathematical induction

RAC
 Rev. R. Acad. Cien. Serie A. Mat. VOL), 2004, pp. 153–180 Ciencias de la Computaci´on / Computational Sciences

Source URL: www-i2.informatik.rwth-aachen.de

• Mathematics
• Logic
• Theoretical computer science
• Mathematical logic
• Automated theorem proving
• Type theory
• Logic in computer science
• Nqthm
• Mathematical induction
• Mathematical proof
• Recursive definition
• Induction

The Weird Machines in Proof-Carrying Code IEEE Security and Privacy LangSec Workshop 2014 Invited paper Julien Vanegue Bloomberg L.P. New York, USA.

Source URL: openwall.info

• Theoretical computer science
• Formal methods
• Computer science
• Software engineering
• Logic in computer science
• Dependently typed programming
• Proof assistants
• Proof-carrying code
• Formal verification
• Mathematical proof
• CurryHoward correspondence
• Algorithm

Proofs, Pictures, and Euclid John Mumma MayThe prevailing conception of mathematical proof, or at least the conception which has been developed most thoroughly, is logical. A proof, accordingl

Source URL: www.fitelson.org

The 2007 Federated Conference on Rewriting, Deduction and Programming Paris, France June 25 – 29, 2007 PATE’07

Source URL: www.cs.ru.nl

• Mathematical proof
• Mathematics
• KeY
• Equivalence relation
• Epistemology
• Knowledge

Proof Theory and Mathematical Meaning of Paraconsistent C-Systems Paolo Gentilini a,b,∗ , a Istituto di Matematica Applicata e Tecnologie Informatiche del Consiglio

Source URL: www.gentilini.ge.it

Premises as Resources Johannes C. Flieger Scheme UK April 2003 Abstract Premises as resources; Weakening and Contraction; central notions

Source URL: schematics.sourceforge.net

• Logic
• Mathematical logic
• Proof theory
• Abstraction
• Non-classical logic
• Sequent
• NC
• Linear logic
• Constructible universe
• CurryHoward correspondence
• Natural deduction

2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

Source URL: www.sigact.org

• Probabilistic complexity theory
• Theoretical computer science
• Morphisms
• Computational complexity theory
• PCP theorem
• Mathematical optimization
• Probabilistically checkable proof
• Combinatorica
• IP
• Algorithm
• Russell Impagliazzo
• Graph isomorphism

FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:

Source URL: www.mathematik.tu-darmstadt.de